Notes on the Roots of Ehrhart Polynomials
نویسندگان
چکیده
We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n , where n is the dimension. This improves on the previously best known bound n and complements a recent result of Braun [8] where it is shown that the norm of a root of a Ehrhart polynomial is at most of order n. For the class of 0-symmetric lattice polytopes we present a conjecture on the smallest volume for a given number of interior lattice points and prove the conjecture for crosspolytopes. We further give a characterisation of the roots of the Ehrhart polyomials in the 3-dimensional case and we classify for n ≤ 4 all lattice polytopes whose roots of their Ehrhart polynomials have all real part -1/2. These polytopes belong to the class of reflexive polytopes.
منابع مشابه
Roots of Ehrhart Polynomials and Symmetric Δ-vectors
Abstract. The conjecture on roots of Ehrhart polynomials, stated by Matsui et al. [15, Conjecture 4.10], says that all roots α of the Ehrhart polynomial of a Gorenstein Fano polytope of dimension d satisfy − d 2 ≤ Re(α) ≤ d 2 − 1. In this paper, we observe the behaviors of roots of SSNN polynomials which are a wider class of the polynomials containing all the Ehrhart polynomials of Gorenstein F...
متن کاملCoefficients and Roots of Ehrhart Polynomials
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We also investigate the roots of Ehrhart polynomials. We prove that for fixed d, there exists a bounded region of C containing all roots of Ehrhart polynomials...
متن کاملCounterexamples of the Conjecture on Roots of Ehrhart Polynomials
An outstanding conjecture on roots of Ehrhart polynomials says that all roots α of the Ehrhart polynomial of an integral convex polytope of dimension d satisfy −d ≤ R(α) ≤ d − 1. In this paper, we suggest some counterexamples of this conjecture.
متن کاملar X iv : m at h / 04 02 14 8 v 1 [ m at h . C O ] 9 F eb 2 00 4 COEFFICIENTS AND ROOTS OF EHRHART POLYNOMIALS
The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We also investigate the roots of Ehrhart polynomials. We prove that for fixed d, there exists a bounded region of C containing all roots of Ehrhart polynomials...
متن کاملRoots of Ehrhart Polynomials Arising from Graphs
Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck et al. that all roots α of Ehrhart polynomials of polytopes of dimension D satisfy −D ≤ Re(α) ≤ D − 1, but also reveals some interesting phenomena for each type of polytope. Here we present two new conjectu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 38 شماره
صفحات -
تاریخ انتشار 2007